Detecting violations of access control and information flow policies in data flow diagrams

The security of software-intensive systems is frequently attacked. High fines or loss in reputation are potential consequences not maintaining confidentiality, which an important objective. Detecting confidentiality issues early software designs enables cost-efficient fixes. A Data Flow Diagram (DFD) a modeling notation, focuses on essential, functional aspects such designs. Existing analyses DFDs support either information flow control access control, the most common mechanisms. Combining both mechanisms can be beneficial but existing DFD do this. This lack expressiveness requires designers to switch languages consider mechanisms, lead inconsistencies. In this article, we present extended syntax that supports both, and same language. improves compared related work avoids We define semantics by clauses first-order logic. logic program made these automated detection violations querying it. evaluate case study. attempt model nine cases six cases. successfully modeled fourteen out fifteen cases, indicates good expressiveness. reusability models when switching comparing share system design, three pairs show improved state art. evaluated accuracy executing them for could model. experienced accuracy.